Uniform linear embeddings of graphons
نویسندگان
چکیده
منابع مشابه
Uniform Linear Embeddings of Spatial Random Graphs
In a random graph with a spatial embedding, the probability of linking to a particular vertex v decreases with distance, but the rate of decrease may depend on the particular vertex v, and on the direction in which the distance increases. In this article, we consider the question when the embedding can be chosen to be uniform, so the probability of a link between two vertices depends only on th...
متن کاملPlanar Embeddings with Small and Uniform Faces
Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and such that all faces have the same size, respectively. We prove a complexity dichotomy for MINMAXFACE and show that deciding whether the maximum is at most k is...
متن کاملCoarse and Uniform Embeddings into Reflexive Spaces
Answering an old problem in nonlinear theory, we show that c0 cannot be coarsely or uniformly embedded into a reflexive Banach space, but that any stable metric space can be coarsely and uniformly embedded into a reflexive space. We also show that certain quasi-reflexive spaces (such as the James space) also cannot be coarsely embedded into a reflexive space and that the unit ball of these spac...
متن کاملRandom linear embeddings
This lemma states that any finite point set can be linearly embedded into Rk such that all pairwise distances are approximately preserved. What is remarkable is that the required target dimension k does not depend on the source dimension d at all. Therefore, any data analysis that depends only on interpoint Euclidean distances between n data points can be approximately carried out in dimension ...
متن کاملFinitely forcible graphons
We investigate families of graphs and graphons (graph limits) that are determined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by finitely many subgraph densities. Generalizing results of Turán, Erdős–Simonovits and Chung–Graham–Wilson, we construct numerous finitely forcible graphon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2017
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2016.09.004